Abscon 2005

AbsCon: A Prototype to Solve CSPs with Abstraction

In this paper, we present a Java constraint programming prototype called AbsCon which has been conceived to deal with CSP abstraction. AbsCon considers n-ary constraints and implements diierent value and variable ordering heuristics as well as diierent propagation methods. As AbsCon exploits object technology, it is easy to extend its functionalities.

Abscon 109 A generic CSP solver

This paper describes the algorithms, heuristics and general strategies used by the two solvers which have been elaborated from the Abscon platform and submitted to the second CSP solver competition. Both solvers maintain generalized arc consistency during search, explore the search space using a conflict-directed variable ordering heuristic, integrate nogood recording from restarts and exploit ...

Abstraction de réseaux de contraintes

ion de réseaux de contraintes Sylvain Merchez — Christophe Lecoutre — Frédéric Boussemart CRIL (Centre de Recherche en Informatique de Lens) CNRS FRE 2499 rue de l’université, SP 16 F-62307 Lens cedex {merchez,lecoutre,boussemart}@cril.univ-artois.fr RÉSUMÉ. Dans ce papier, nous nous intéressons à l’abstraction de réseaux de contraintes. Nous présentons un cadre théorique permettant de prendre ...

Abscon 112 Toward more Robustness

This paper describes the three main improvements made to the solver Abscon 109 [9]. The new version, Abscon 112, is able to automatically break some variable symmetries, infer allDifferent constraints from cliques of variables that are pair-wise irreflexive, and use an optimized version of the STR (Simple Tabular Reduction) technique initially introduced by J. Ullmann for table constraints. 1 F...

Persian-translation vol.2, no.2 October 2005